Amortized Complexity Analysis for Red-Black Trees and Splay Trees
نویسندگان
چکیده
منابع مشابه
Relativistic red-black trees
Operating system performance and scalability on sharedmemory many-core systems depends critically on efficient access to shared data structures. Scalability has proven difficult to achieve for many data structures. In this paper we present a novel and highly scalable concurrent red-black tree. Red-black trees are widely used in operating systems, but typically exhibit poor scalability. Our red-...
متن کاملConstructing Red-Black Trees
This paper explores the structure of red-black trees by solving an apparently simple problem: given an ascending sequence of elements, construct, in linear time, a red-black tree that contains the elements in symmetric order. Several extreme red-black tree shapes are characterized: trees of minimum and maximum height, trees with a minimal and with a maximal proportion of red nodes. These charac...
متن کاملLeft-leaning Red-Black Trees
The red-black tree model for implementing balanced search trees, introduced by Guibas and Sedgewick thirty years ago, is now found throughout our computational infrastructure. Red-black trees are described in standard textbooks and are the underlying data structure for symbol-table implementations within C++, Java, Python, BSD Unix, and many other modern systems. However, many of these implemen...
متن کاملSpecification of Red-Black Trees
Complex data structures still pose a major challenge in specification and verification of objectoriented programs. Leino and Moskal have proposed a suite of benchmarks for verification tools, nicknamed “VACID-0” [1]. In contrast to similar papers, the tasks of VACID-0 do not only include verification in terms of an observable behavior but also of internal workings of algorithms and data structu...
متن کاملMulti-Splay Trees
In this thesis, we introduce a new binary search tree data structure called multi-splay tree and prove that multi-splay trees have most of the useful properties different binary search trees (BSTs) have. First, we demonstrate a close variant of the splay tree access lemma [ST85] for multi-splay trees, a lemma that implies multi-splay trees have the O(log n) runtime property, the static finger p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Innovative Research in Computer Science & Technology
سال: 2018
ISSN: 2347-5552
DOI: 10.21276/ijircst.2018.6.6.2